Weighted Constraint Satisfaction and Genetic Algorithm to Solve the View Selection Problem
نویسندگان
چکیده
منابع مشابه
Weighted Constraint Satisfaction and Genetic Algorithm to Solve the View Selection Problem
A Data warehouse is a tool that is used by big companies, and it gathers data coming from different sources. The main goal of a data warehouse is not only to store data, but also to help companies to make decisions. The huge volume of data makes processing queries complex and time-consuming. In order to solve this problem, the materialization of views is suggested as a solution to improve the p...
متن کاملModeling View Selection as a Constraint Satisfaction Problem
Using materialized views can highly speed up the query processing time. This paper deals with the view selection issue, which consists in finding a set of views to materialize that minimizes the expected cost of evaluating the query workload, given a limited amount of resource such as total view maintenance cost and/or storage space. However, the solution space is huge since it entails a large ...
متن کاملUsing an evolutionary algorithm to solve the weighted view materialisation problem for data warehouses
A common problem in data warehousing is reduction of response time for ad hoc queries. To reduce query processing time, a selected number of views are materialised. Selecting the optimal number of views in a data warehouse is known to be an NP-complete problem as no feasible deterministic algorithm exists. In this paper, we discuss a weighted materialised view selection (MVS) problem where both...
متن کاملUsing an Evolutionary Algorithm to Solve the Weighted View Materialization Problem for DataWarehouses
A common problem in data warehousing is reduction of response time for ad-hoc queries. To reduce query processing time, a selected number of views are materialized. Selecting the optimal number of views in a data warehouse is known to be an NP-complete problem as no feasible deterministic algorithm exists. In this paper we discuss a weighted materialized view selection (MVS) problem where both ...
متن کاملAn Efficient Genetic Algorithm to Solve the Intermodal Terminal Location problem
The exponential growth of the flow of goods and passengers, fragility of certain products and the need for the optimization of transport costs impose on carriers to use more and more multimodal transport. In addition, the need for intermodal transport policy has been strongly driven by environmental concerns and to benefit from the combination of different modes of transport to cope with the in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Database Management Systems
سال: 2017
ISSN: 0975-5985,0975-5705
DOI: 10.5121/ijdms.2017.9402